منابع مشابه
Entropy-driven demixing in binary hard-core mixtures: From hard spherocylinders towards hard spheres
We present a computer simulation study of a binary mixture of hard spherocylinders with different diameters (D1,D2) and the same lengths (L15L25L). We first study a mixture of spherocylinders with lengths L 515D2 and D150, which can be regarded as a mixture of rodlike colloids and ideal needles. We find clearly an entropy-driven isotropic-isotropic (I-I) demixing transition in this mixture. In ...
متن کاملExciting hard spheres.
We investigate the collision cascade that is generated by a single moving particle in a static and homogeneous hard-sphere gas. We argue that the number of moving particles at time t grows as t;{xi} and the number collisions up to time t grows as t;{eta} , with xi=2d(d+2) , eta=2(d+1)(d+2) , and d the spatial dimension. These growth laws are the same as those from a hydrodynamic theory for the ...
متن کاملA New Mixing Rule for Mixtures of Hard Spheres
A mixing rule for the mixtures of hard-spheres is presented which can be reduced to the standard van der Waals mixing rule at low densities. The effectiveness of the mixing rule for the size and energy parameters of lennard-Jones fluid are examined by combining them with an equation of state to calculate thermodynamic properties. The results of calculation are compared with the molecular dy...
متن کاملPercolation in suspensions of hard nanoparticles: From spheres to needles
We investigate geometric percolation and scaling relations in suspensions of nanorods, covering the entire range of aspect ratios from spheres to extremely slender needles. A new version of connectedness percolation theory is introduced and tested against specialised Monte Carlo simulations. The theory accurately predicts percolation thresholds for aspect ratios of rod length to width as low as...
متن کاملHard-Core Distributions for Somewhat Hard Problems
Consider a decision problem that cannot be 1 ? approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a fraction of instances. We show that for any such problem there is a speciic \hard-core" set of inputs which is at least a fraction of all inputs and on which no circuit of a slightly smaller size can get even a small advantage ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2021
ISSN: 2469-9950,2469-9969
DOI: 10.1103/physrevb.103.104407